Minimum-Cost Bounded-Skew Clock Routing
نویسندگان
چکیده
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) in two steps: (i) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the exact locations of clock entry points. Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of routing solutions with skew and wirelength trade-off.
منابع مشابه
Minimum-Cost Bounided-Skew Clock Routing*
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) in two steps: (i) a bottom-up phase to construct a binary tree of shortest-distancefeasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the exa...
متن کاملA Simple Yet Effective Merging Scheme for Prescribed-Skew Clock Routing
In order to achieve multi-GHz operation frequency for VLSI design, clock networks need to be designed in a very elaborated manner and be able to deliver prescribed useful skews rather than merely zero-skew. Although traditional zero-skew clock routing methods can be extended directly to prescribed skews, they tend to result in excessive wirelength as the differences among delay-targets for cloc...
متن کاملProcess-Variation Robust and Low-Power Zero-Skew Buffered Clock-Tree Synthesis Using Projected Scan-Line Sampling
Process-variation induced skew has become one of the major contributors to the clock-skew in advanced technologies. Since process-variation induced skew is roughly proportional to clock-delay, it is preferable to design zero-skew clock-trees and have minimum clock-delay to reduce both unintentional and process-variation induced skews. In this paper, we propose a zero-skew buffered clock-tree sy...
متن کاملA Bu er Distribution Algorithm for High - PerformanceClock
We introduce a new approach for optimizing clock tree, especially for high-speed circuits. Our approach provides a useful guideline to a designer; by user-speciied parameters, design favors will be satissed. Three of these tradeoos will be provided in this chapter. 1) First, to provide a \good" tradeoo between skew and wirelength, a new clock tree routing scheme is proposed. The technique is ba...
متن کاملMatching-based methods for high-performance clock routing
Minimizing clock skew is important in the design of high performance VLSI systems. We present a general clock routing scheme that achieves very small clock skews while still using a reasonable amount of wirelength. Our routing solution is based on the construction of a binary tree using geometric matching. For cell-based designs, the total wirelength of our clock routing tree is on average with...
متن کامل